On-Line Recognition of Handwritten Mathematical Expressions Based on Stroke-Based Stochastic Context-Free Grammar

نویسندگان

  • Ryo Yamamoto
  • Shinji Sako
  • Takuya Nishimoto
  • Shigeki Sagayama
چکیده

In this paper, we propose a new framework for online handwritten mathematical expression recognition. In this approach, we consider handwritten mathematical expressions as the output of stroke generation processes based on a stochastic context-free grammar which generates handwritten expressions stochastically. We estimate the most likely expression candidate derived from the grammar, rather than solving one by one the three major problems in mathematical expression recognition: symbol segmentation/recognition, 2D structure recognition, and expression syntax analysis. With this method, we can simultaneously recognize the symbols and structure of an expression within the grammatical constraint. Experiments revealed that this simultaneous estimation decreases errors in symbol segmentation and recognition, and that these errors are reduced as grammatical restriction is strengthened.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Recognition of on-line handwritten mathematical expressions using 2D stochastic context-free grammars and hidden Markov models

This paper describes a formal model for the recognition of on-line handwritten mathematical expressions using 2D stochastic context-free grammars and hidden Markov models. Hidden Markov models are used to recognize mathematical symbols, and a stochastic context-free grammar is used to model the relation between these symbols. This formal model makes possible to use classic algorithms for parsin...

متن کامل

On Machine Understanding of Online Handwritten Mathematical Expressions

This paper aims at automatic recognition of online handwritten mathematical expressions written on an electronic tablet. The proposed technique involves two major stages: symbol recognition and structural analysis. A multiple-classifier consists of both parametric and nonparametric classifier has been used for recognition of symbols. Parametric classifier is based on Hidden Markov Model (HMM), ...

متن کامل

On-Line Handwritten Formula Recognition using Hidden Markov Models and Context Dependent Graph Grammars

This paper presents an approach for the recognition of on-line handwritten mathematical expressions. The Hidden Markov Model (HMM) based system makes use of simultaneous segmentation and recognition capabilities, avoiding a crucial segmentation during pre-processing. With the segmentation and recognition results, obtained from the HMMrecognizer, it is possible to analyze and interpret the spati...

متن کامل

Parsing N-Best Lists of Handwritten Sentences

This paper investigates the application of a probabilistic parser for natural language on the list of the Nbest sentences produced by an off-line recognition system for cursive handwritten sentences. For the generation of the N-best sentence list an HMM-based recognizer including a bigram language model is used. The parsing of the sentences is achieved by a bottom-up chart parser for stochastic...

متن کامل

Segmentation and recognition of symbols within handwritten mathematical expressions

In this paper an efficient on-line recognition system for symbols within handwritten mathematical expressions is proposed. The system is based on the generation of a symbol hypotheses net and the classification of the elements within the net. The final classification is done by calculating the most probable path through the net under regard of the stroke group probabilities and the probabilitie...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006